A de Casteljau Algorithm for Bernstein type Polynomials based on (p, q)-integers in CAGD

نویسندگان

  • Khalid Khan
  • D. K. Lobiyal
چکیده

In this paper, a de Casteljau algorithm to compute (p, q)-Bernstein Bézier curves based on (p, q)integers is introduced. We study the nature of degree elevation and degree reduction for (p, q)-Bézier Bernstein functions. The new curves have some properties similar to q-Bézier curves. Moreover, we construct the corresponding tensor product surfaces over the rectangular domain (u, v) ∈ [0, 1]× [0, 1] depending on four parameters. We also study the de Casteljau algorithm and degree evaluation properties of the surfaces for these generalization over the rectangular domain. Furthermore, some fundamental properties for (p, q)-Bernstein Bézier curves are discussed. We get q-Bézier curves and surfaces for (u, v) ∈ [0, 1]× [0, 1] when we set the parameter p1 = p2 = 1.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bezier curves based on Lupas (p, q)-analogue of Bernstein polynomials in CAGD

In this paper, we use the blending functions of Lupaş type (rational) (p, q)-Bernstein operators based on (p, q)-integers for construction of Lupaş (p, q)-Bézier curves (rational curves) and surfaces (rational surfaces) with shape parameters. We study the nature of degree elevation and degree reduction for Lupaş (p, q)-Bézier Bernstein functions. Parametric curves are represented using Lupaş (p...

متن کامل

Tensor Product q-Bernstein Bézier Patches

Abstract An affine de Casteljau type algorithm to compute q−Bernstein Bézier curves is introduced and its intermediate points are obtained explicitly in two ways. Furthermore we define a tensor product patch, based on this algorithm, depending on two parameters. Degree elevation procedure is studied. The matrix representation of tensor product patch is given and we find the transformation matri...

متن کامل

A formal study of Bernstein coefficients and polynomials

Bernstein coe cients provide a discrete approximation of the behavior of a polynomial inside an interval. This can be used for example to isolate real roots of polynomials. We prove a criterion for the existence of a single root in an interval and the correctness of the de Casteljau algorithm to compute e ciently Bernstein coe cients. Key-words: Polynomials, de Casteljau, Bernstein polynomials,...

متن کامل

On the approximation by Chlodowsky type generalization of (p,q)-Bernstein operators

In the present article, we introduce Chlodowsky variant of $(p,q)$-Bernstein operators and compute the moments for these operators which are used in proving our main results. Further, we study some approximation properties of these new operators, which include the rate of convergence using usual modulus of continuity and also the rate of convergence when the function $f$ belongs to the class Li...

متن کامل

On a generalization of Bernstein polynomials and Bézier curves based on umbral calculus

In [20] a generalization of Bernstein polynomials and Bézier curves based on umbral calculus has been introduced. In the present paper we describe new geometric and algorithmic properties of this generalization including: (1) families of polynomials introduced by Stancu [19] and Goldman [12], i.e., families that include both Bernstein and Lagrange polynomial, are generalized in a new way, (2) a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1507.04110  شماره 

صفحات  -

تاریخ انتشار 2015